1 Worst - Case vs . Average - Case Complexity
نویسنده
چکیده
So far we have dealt mostly with the worst-case complexity of problems. We might also wonder aobut the average-case complexity of a problem, namely, how difficult the problem is to solve for an instance chosen randomly from some distribution. It may be the case for a certain problem that hard instances exist but are extremely rare. Many reductions use very specifically constructed problems, so their conclusions may not apply to “average” problems from a class. For example, consider the problem of sorting a list of integers. We can define the worst-case complexity:
منابع مشابه
Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy
We show that for every integer k > 1, if Σk, the k’th level of the polynomial-time hierarchy, is worst-case hard for probabilistic polynomial-time algorithms, then there is a language L ∈ Σk such that for every probabilistic polynomial-time algorithm that attempts to decide it, there is a samplable distribution over the instances of L, on which the algorithm errs with probability at least 1/2 −...
متن کاملCs 880: Advanced Complexity Theory Lecture 13: Average-case Hardness 1 Worst-case vs. Average-case Complexity
In this lecture and the next two lectures we study hardness amplification, in which the goal is to take a mildly average-case hard function from some class and construct another function in that class that is very average-case hard. Today we prove a lemma that roughly states that every average-case hard function has a set of inputs that encapsulates the hardness of that function in a certain se...
متن کاملAn Improved Worst - Case to Average - CaseConnection
We improve a connection of the worst-case complexity and the average-case complexity of some well-known lattice problems. This fascinating connection was rst discovered by Ajtai 1] in 1996. We improve the exponent of this connection from 8 to 3:5 + .
متن کاملGeneralized Leapfrogging Samplesort: A Class of O(n log2n) Worst-Case Complexity and O(n log n) Average-Case Complexity Sorting Algorithms
The original Leapfrogging Samplesort operates on a sorted sample of size s and an unsorted part of size s+1. We generalize this to a sorted sample of size s and an unsorted part of size (2 − 1)(s+1), where k = O(1). We present a practical implementation of this class of algorithms and we show that the worst-case complexity is O(n log n) and the average-case complexity is O(n log n).
متن کاملHardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1} → {0, 1} that is mildly hard on average, i.e. every circuit of size 2 fails to compute f on at least a 1/poly(l) fraction of inputs, we can build a PRG : {0, 1} n) → {0, 1} computable in ATIME (O(1), log n) = alternating time O(lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009